Brooks’ theorem on powers of graphs
نویسندگان
چکیده
منابع مشابه
Brooks' theorem on powers of graphs
We prove that for k ≥ 3, the bound given by Brooks’ theorem on the chromatic number of k-th powers of graphs of maximum degree ∆ ≥ 3 can be lowered by 1, even in the case of online list coloring.
متن کاملOn Brooks' Theorem for Sparse Graphs
Let G be a graph with maximum degree ∆(G). In this paper we prove that if the girth g(G) of G is greater than 4 then its chromatic number, χ(G), satisfies χ(G) ≤ (1 + o(1)) ∆(G) log ∆(G) where o(1) goes to zero as ∆(G) goes to infinity. (Our logarithms are base e.) More generally, we prove the same bound for the list-chromatic (or choice) number: χ l (G) ≤ (1 + o(1)) ∆(G) log ∆(G) provided g(G)...
متن کاملA Brooks' Theorem for Triangle-Free Graphs
Let G be a triangle-free graph with maximum degree ∆(G). We show that the chromatic number χ(G) is less than 67(1 + o(1))∆/ log∆.
متن کاملA note on Brooks' theorem for triangle-free graphs
For the class of triangle-free graphs Brooks’ Theorem can be restated in terms of forbidden induced subgraphs, i.e. let G be a triangle-free and K1,r+1-free graph. Then G is r-colourable unless G is isomorphic to an odd cycle or a complete graph with at most two vertices. In this note we present an improvement of Brooks’ Theorem for triangle-free and rsunshade-free graphs. Here, an r-sunshade (...
متن کاملA matroid analogue of a theorem of Brooks for graphs
Brooks proved that the chromatic number of a loopless connected graph G is at most the maximum degree of G unless G is an odd cycle or a clique. This note proves an analogue of this theorem for GF (p)-representable matroids when p is prime, thereby verifying a natural generalization of a conjecture of Peter Nelson.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Mathematics
سال: 2014
ISSN: 0012-365X
DOI: 10.1016/j.disc.2014.01.024